Differential approximations for min set cover
نویسندگان
چکیده
We present in this paper differential approximation results for min set cover and min weighted set cover. We first show that the differential approximation ratio of the natural greedy algorithm for min set cover is bounded below by 1.365/∆ and above by 4/(∆+1), where ∆ is the maximum set-cardinality in the min set cover-instance. Next we study another approximation algorithm for min set cover that computes 2-optimal solutions, i.e., solutions that cannot be improved by removing two sets belonging to them and adding another set not belonging to them. We prove that the differential approximation ratio of this second algorithm is bounded below by 2/(∆ + 1) and that this bound is tight. Finally, we study an approximation algorithm for min weighted set cover and provide a tight lower bound of 1/∆. Our results identically hold for max hypergraph independent set in both the standard and the differential approximation paradigms.
منابع مشابه
Legendre Wavelets for Solving Fractional Differential Equations
In this paper, we develop a framework to obtain approximate numerical solutions to ordinary differential equations (ODEs) involving fractional order derivatives using Legendre wavelets approximations. The continues Legendre wavelets constructed on [0, 1] are utilized as a basis in collocation method. Illustrative examples are included to demonstrate the validity and applicability of the techn...
متن کاملApproximate Solution of Fuzzy Fractional Differential Equations
In this paper we propose a method for computing approximations of solution of fuzzy fractional differential equations using fuzzy variational iteration method. Defining a fuzzy fractional derivative, we verify the utility of the method through two illustrative examples.
متن کاملt-BEST APPROXIMATION IN FUZZY NORMED SPACES
The main purpose of this paper is to find t-best approximations in fuzzy normed spaces. We introduce the notions of t-proximinal sets and F-approximations and prove some interesting theorems. In particular, we investigate the set of all t-best approximations to an element from a set.
متن کاملNew lower bounds for Approximation Algorithms in the Lovász-Schrijver Hierarchy
Determining how well we can efficiently compute approximate solutions to NPhard problems is of great theoretical and practical interest. Typically the famous PCP theorem is used for showing that a problem has no algorithms computing good approximations. Unfortunately, for many problem this approach has failed. Nevertheless, for such problems, we may instead be able to show that a large subclass...
متن کامل